Consensus on the Average on Arbitrary Strongly Connected Digraphs Based on Broadcast Gossip Algorithms
نویسندگان
چکیده
In this paper we propose a new decentralized algorithm to solve the consensus on the average problem on arbitrary strongly connected digraphs through a gossip algorithm based on broadcasts. We directly extend previous results by not requiring that the digraph is balanced. Our algorithm is an improvement respect to known gossip algorithms based on broadcasts in that the average of the initial state is preserved after each broadcast. The nodes are assumed to know their out-degree anytime they transmit information. The algorithm convergence analysis is preliminary and performance is shown by simulations. Published as: M. Franceschelli, A. Giua, C. Seatzu " Consensus on the Average on Arbitrary Strongly Connected Digraphs Based on Broadcast Gossip Algorithms" 1st IFAC Workshop on Estimation and Control of Networked Systems, (Venice, Italy), Sep. 2009. M. Franceschelli, A. Giua and C. Seatzu are with the Dept. of Electrical and Electronic Engineering, University of Cagliari, Piazza D’Armi, 09123 Cagliari, Italy. Email: [email protected], {giua,seatzu}@diee.unica.it.
منابع مشابه
Average Consensus on General Strongly Connected Digraphs
We study the average consensus problem of multi-agent systems for general network topologies with unidirectional information flow. We propose two (linear) distributed algorithms, deterministic and gossip, respectively for the cases where the inter-agent communication is synchronous and asynchronous. Our contribution is that in both cases, the developed algorithms guarantee state averaging on ar...
متن کاملQuantized Average Consensus on Gossip Digraphs with Reduced Computation
The authors have recently proposed a class of randomized gossip algorithms which solve the distributed averaging problem on directed graphs, with the constraint that each node has an integer-valued state. The essence of this algorithm is to maintain local records, called “surplus”, of individual state updates, thereby achieving quantized average consensus even though the state sum of all nodes ...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملAverage-Consensus Algorithms in a Deterministic Framework
We consider the average-consensus problem in a multi-node network of finite size. Communication between nodes is modeled by a sequence of directed signals with arbitrary communication delays. Four distributed algorithms that achieve average-consensus are proposed. Necessary and sufficient communication conditions are given for each algorithm to achieve average-consensus. Resource costs for each...
متن کاملAverage consensus in sensor networks via broadcast multi-gossip algorithms
Motivated by applications to wireless sensor, peer-to-peer, and ad hoc networks, we propose a distributed algorithm called broadcast based multi-gossiping algorithm (BMGA), which is designed for exchanging information and computing in an arbitrarily connected network of nodes. Unlike traditional randomized gossip algorithms, push-sum mechanism based BMGA preserves the sums and weights, and admi...
متن کامل